#include <iostream>
#include <algorithm>
#include <unordered_set>
using namespace std;
typedef long long ll;
int k, t;
unordered_set<ll> row;
unordered_set<ll> col;
unordered_set<ll> dig1;
unordered_set<ll> dig2;
int ret = 2e9;
int main() {
    cin >> k;
    for (int i = 1; i <= k; i++) {
        int x, y;
        cin >> x >> y;
        if (ret!=2e9) continue;
        if (row.count(x) || col.count(y) || dig1.count(y - x) || dig2.count(y + x)) {
            ret = i;
            continue;
        }
        row.insert(x);
        col.insert(y);
        dig1.insert(y - x);
        dig2.insert(y + x);
    }
    cin >> t;
    while (t--) {
        int ans;
        cin >> ans;
        if (ans >= ret) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}